Note on non-uniform bin packing games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on non-uniform bin packing games

A non-uniform bin packing game is an N-person cooperative game, where the set N is defined by k bins of capacities b1, . . . , bk and n items of sizes a1, . . . , an. The objective function v of a coalition is the maximum total value of the items of that coalition which can be packed to the bins of that coalition. We investigate the taxation model of Faigle and Kern (1993) [2] and show that the...

متن کامل

On Colorful Bin Packing Games

We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of m ≥ 2 colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are interested in selecting a bin of minimum shared cos...

متن کامل

Bin Packing Games

The bin packing game is a cooperative N -person game, where the set of players consists of k bins, each has capacity 1 and n items of sizes a1, a2, ⋅ ⋅ ⋅ , an, w.l.o.g, we assume 0 ≤ ai ≤ 1 for all 1 ≤ i ≤ n. The value function of a coalition of bins and items is the maximum total size of items in the coalition that can be packed into the bins of the coalition. A typical question of the bin pac...

متن کامل

On Variable-Sized Bin Packing

In variable sized bin packing, a number of bin types are given and the goal is to pack a list of items by choosing appropriate bins such that the total size of bins used is minimized. In this paper, we present absolute worst-case analysis for on-line algorithms. Then we consider an related problem: how to design k different bin sizes such that for any item list the waste space of bins used is m...

متن کامل

Bin Packing

In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2014

ISSN: 0166-218X

DOI: 10.1016/j.dam.2012.08.002